#include <cstdio>
#include <queue>
#include <algorithm>

using namespace std;

struct Node
{
    __int64 r[ 3 ], c[ 3 ];
};

bool operator < ( const Node &a, const Node &b )
{
    if ( a.c[ 0 ] != b.c[ 0 ] )
        return a.c[ 0 ] < b.c[ 0 ];
    if ( a.c[ 1 ] != b.c[ 1 ] )
        return a.c[ 1 ] < b.c[ 1 ];
    return a.c[ 2 ] < b.c[ 2 ];
}

struct cmp1
{
    bool operator()( const Node &a, const Node &b )
    {
        return a.c[ 1 ] > b.c[ 1 ];
    }
};

struct cmp2
{
    bool operator()( const Node &a, const Node &b )
    {
        return a.c[ 2 ] > b.c[ 2 ];
    }
};

int n, m;
__int64 p[ 3 ];
Node a[ 50001 ];

void init( )
{
    int i, j;
    for ( i = 0; i < m; i++ )
        for ( j = 0; j < n; j++ )
            scanf("%I64d", &a[ j ].r[ i ]);
    for ( i = m; i < 3; i++ )
        for ( j = 0; j < n; j++ )
            a[ j ].r[ i ] = 0;
    for ( i = 0; i < m; i++ )
        for ( j = 0; j < n; j++ )
            scanf("%I64d", &a[ j ].c[ i ]);
    for ( i = m; i < 3; i++ )
        for ( j = 0; j < n; j++ )
            a[ j ].c[ i ] = 0;
    for ( i = 0; i < m; i++ )
        scanf("%I64d", &p[ i ]);
    for ( i = m; i < 3; i++ )
        p[ i ] = 0;
    sort( a, a + n );
}

void work( )
{
    int i, cnt = 0;
    priority_queue<Node, vector<Node>, cmp1> q1;
    priority_queue<Node, vector<Node>, cmp2> q2;
    for ( i = 0; i < n; i++ )
    {
        if ( p[ 0 ] >= a[ i ].c[ 0 ] )
            q1.push( a[ i ] );
        else
            break;
        while ( !q1.empty( ) && p[ 1 ] >= q1.top( ).c[ 1 ] )
        {
            q2.push( q1.top( ) );
            q1.pop( );
            while( !q2.empty( ) && p[ 2 ] >= q2.top( ).c[ 2 ] )
            {
                cnt++;
                p[ 0 ] += q2.top( ).r[ 0 ];
                p[ 1 ] += q2.top( ).r[ 1 ];
                p[ 2 ] += q2.top( ).r[ 2 ];
                q2.pop( );
            }
        }
    }
    if ( cnt != n )
        puts("No");
    else
        puts("Yes");
}

int main( )
{
    while ( scanf("%d%d", &n, &m) != EOF )
    {
        init( );
        work( );
    }
    return 0;
}
